Algorithms for continuous top-k processing in social networks
نویسندگان
چکیده
Information streams are mainly produced today by social networks, but current methods for continuous top-k processing of such streams are still limited to contentbased similarity. We present the SANTA algorithm, able to handle also social network criteria and events, and report a preliminary comparison with an extension of a state-of-the-art algorithm.
منابع مشابه
Continuous Top-k Queries in Social Networks
Information streams provide today a prevalent way of publishing and consuming content on the Web, especially due to the great success of social networks. Top-k queries over the streams of interest allow limiting results to the most relevant content, while continuous processing of such queries is the most effective approach in large scale systems. However, current systems fail in combining conti...
متن کاملAnalysis and Evaluation of Privacy Protection Behavior and Information Disclosure Concerns in Online Social Networks
Online Social Networks (OSN) becomes the largest infrastructure for social interactions like: making relationship, sharing personal experiences and service delivery. Nowadays social networks have been widely welcomed by people. Most of the researches about managing privacy protection within social networks sites (SNS), observes users as owner of their information. However, individuals cannot co...
متن کاملAnalyzing Tools and Algorithms for Privacy Protection and Data Security in Social Networks
The purpose of this research, is to study factors influencing privacy concerns about data security and protection on social network sites and its’ influence on self-disclosure. 100 articles about privacy protection, data security, information disclosure and Information leakage on social networks were studied. Models and algorithms types and their repetition in articles have been distinguished a...
متن کاملA Detailed Evaluation of Threshold Algorithms for Answering Top-k queries in Peer-to-Peer Networks
Ranking queries, also known as top-k queries, have drawn considerable attention due to their usability in various applications. Several algorithms have been proposed for the evaluation of top-k queries. A large percentage of them follow the Threshold Approach. In p2p networks, top-k query processing can provide a lot of advantages both in time and bandwidth consumption. We focus on the main ada...
متن کاملTop-K Query Processing in Edge-Labeled Graph Data
Title of dissertation: TOP-K QUERY PROCESSING IN EDGE-LABELED GRAPH DATA Noseong Park, Doctor of Philosophy, 2016 Dissertation directed by: Professor V.S. Subrahmanian Department of Computer Science Edge-labeled graphs have proliferated rapidly over the last decade due to the increased popularity of social networks and the Semantic Web. In social networks, relationships between people are repre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015